Generating random polygons with given vertices

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating Random Polygons with Given Vertices

The problem of generating \random" geometric objects is motivated by the need to generate test instances for geometric algorithms. We examine the speciic problem of generating a random x-monotone polygon on a given set of n vertices. Here, \random" is taken to mean that we select uniformly at random a polygon, from among all those x-monotone polygons having the given n vertices. We give an algo...

متن کامل

Generating Sunflower Random Polygons on a Set of Vertices

Abstract Generating random polygons problem is important for verification of geometric algorithms. Moreover, this problem has applications in computing and verification of time complexity for computational geometry algorithms such as Art Gallery. Since it is often not possible to get real data, a set of random data is a good alternative. In this paper, a heuristic algorithm is proposed for gene...

متن کامل

Quadratic-Time Linear-Space Algorithms for Generating Orthogonal Polygons with a Given Number of Vertices

We propose Inflate-Paste – a new technique for generating orthogonal polygons with a given number of vertices from a unit square based on gluing rectangles. It is dual to Inflate-Cut – a technique we introduced in [12] that works by cutting rectangles.

متن کامل

Generating Random Orthogonal Polygons

We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a technique we developed to obtain polygons with an increasing number of vertices starting from a unit square. The other follows a constraint programming approach and gives great control on the generated polygons. In particular, it...

متن کامل

Generating random star-shaped polygons

In this paper we deal with two problems on star-shaped polygons. At rst, we present a Las-Vegas algorithm that uniformly at random creates a star-shaped polygon whose vertices are given by a point set S of n points in the plane that does not admit degenerated star-shaped polygons. The expected running time of the algorithm is O(n logn) and it uses O(n) memory. We call a starshaped polygon degen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Geometry

سال: 1996

ISSN: 0925-7721

DOI: 10.1016/0925-7721(95)00031-3